PAV and the ROC convex hull

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Technical Note: PAV and the ROC Convex Hull

Classifier calibration is the process of converting classifier scores into reliable probability estimates. Recently, a calibration technique based on isotonic regression has gained attention within machine learning as a flexible and effective way to calibrate classifiers. We show that, surprisingly, isotonic regression based calibration using the Pool Adjacent Violators algorithm is equivalent ...

متن کامل

ROCCER: A ROC convex hull rule learning algorithm

In this paper we propose a method to construct rule sets that have a convex hull in ROC space. We introduce a rule selection algorithm called ROCCER, which operates by selecting rules from a larger set of rules in order to optimise Area Under the ROC Curve (AUC). Compared with set covering algorithms, our method is less dependent on the previously induced rules. Experimental results on three UC...

متن کامل

Sumsets and the Convex Hull

We extend Freiman's inequality on the cardinality of the sumset of a d dimensional set. We consider different sets related by an inclusion of their convex hull, and one of them added possibly several times.

متن کامل

Convex Hull-Based Multi-objective Genetic Programming for Maximizing ROC Performance

Receiver operating characteristic (ROC) is usually used to analyse the performance of classifiers in data mining. An important ROC analysis topic is ROC convex hull(ROCCH), which is the least convex majorant (LCM) of the empirical ROC curve, and covers potential optima for the given set of classifiers. Generally, ROC performance maximization could be considered to maximize the ROCCH, which also...

متن کامل

On Sumsets and Convex Hull

One classical result of Freiman gives the optimal lower bound for the cardinality of A + A if A is a d-dimensional finite set in R. Matolcsi and Ruzsa have recently generalized this lower bound to |A+ kB| if B is d-dimensional, and A is contained in the convex hull of B. We characterize the equality case of the Matolcsi–Ruzsa bound. The argument is based partially on understanding triangulation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Machine Learning

سال: 2007

ISSN: 0885-6125,1573-0565

DOI: 10.1007/s10994-007-5011-0